Valid inequalities for MIPs and group polyhedra from approximate liftings
نویسندگان
چکیده
منابع مشابه
Some continuous functions related to corner polyhedra, II
The group problem on the unit interval is developed, with and without continuous variables. The connection with cutting planes, or valid inequalities, is reviewed. Certain desirable properties of valid inequalities, such as minimality and extremality are developed, and the connection between valid inequalities for P(I, u 0) and P+(I, u 0) is developed. A class of functions is shown to give extr...
متن کاملMixed n-step MIR inequalities: Facets for the n-mixing set
Günlük and Pochet [O. Günlük , Y. Pochet: Mixing mixed integer inequalities. Mathematical Programming 90(2001) 429-457] proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities define the convex hull of the mixing set {(y, . . . , y, v) ∈ Z × R+ : α1y + v ≥ βi, i = 1, . . . ,m} and can also be used to generate valid inequalities for general as well as se...
متن کاملThe Experimental Study of Increased ICP on Cerebral Hemorrhage Rabbits with Magnetic Induction Phase Shift Method
Introduction Measuring magnetic induction phase shift (MIPS) changes as a function of cerebral hemorrhage volume has the potential for being a simple method for primary and non-contact detection of the occurrence and progress of cerebral hemorrhage. Our previous MIPS study showed that the intracranial pressure (ICP) was used as a contrast index and found the primary correlation between MIPS and...
متن کاملLifting properties of maximal lattice-free polyhedra
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This generalizes a previous result by Basu, Cornuéjols and Köppe [BCK12] for simplicial maximal lattice-free polytopes, thus completely settling this fundamental question ...
متن کاملOn cut-based inequalities for capacitated network design polyhedra
In this article we study capacitated network design problems. We unify and extend poly-hedral results for directed, bidirected and undirected link capacity models. Based on validinequalities for a network cut we show that regardless of the link capacity model, facets of thepolyhedra associated with such a cut translate to facets of the original network design polyhedraif the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 118 شماره
صفحات -
تاریخ انتشار 2009